Algorithmic regularization with velocity-dependent forces
نویسندگان
چکیده
منابع مشابه
Algorithmic regularization with velocity-dependent forces
Algorithmic regularization uses a transformation of the equations of motion such that the leapfrog algorithm produces exact trajectories for two-body motion as well as regular results in numerical integration of the motion of strongly interacting few-body systems. That algorithm alone is not sufficiently accurate and one must use the extrapolation method for improved precision. This requires th...
متن کاملA Hybrid N-Body Code Incorporating Algorithmic Regularization and Post-Newtonian Forces
We describe a novel N -body code designed for simulations of the central regions of galaxies containing massive black holes. The code incorporates Mikkola’s “algorithmic” chain regularization scheme including post-Newtonian terms up to PN2.5 order. Stars moving beyond the chain are advanced using a fourth-order integrator with forces computed on a GRAPE board. Performance tests confirm that the...
متن کاملImplementing Few-Body Algorithmic Regularization with Post-Newtonian Terms
We discuss the implementation of a new regular algorithm for simulation of the gravitational few-body problem. The algorithm uses components from earlier methods, including the chain structure, the logarithmic Hamiltonian, and the time-transformed leapfrog. The code can be used for the normal N -body problem, as well as for problems with softened potentials and/or with velocity-dependent extern...
متن کاملTotal Variation Denoising with Spatially Dependent Regularization
Fig. 3: FA maps from the original (left), and the denoised (right) DTI data set. Magnified views of a ROI (bottom) demonstrate feature preservation in fine structures. Fig. 1: A numerical example of spatially variant regularization. (a) A numerical test image. (b) Noisy test image. (c) TV denoising with λ=20. (d) TV denoising with λ=10. (e) λ map: λ=10 (dark region) and λ=20 (bright region). (f...
متن کاملData-Dependent Regularization
Information regularization is a principle for assigning labels to unlabeled data points in a semi-supervised setting. The broader principle is based on finding labels that minimize the information induced between examples and labels relative to a topology over the examples; any label variation within a small local region of examples ties together the identities of examples and their labels. Suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2006
ISSN: 0035-8711,1365-2966
DOI: 10.1111/j.1365-2966.2006.10854.x